Obtaining Repetitive Actions for Genetic Programming with Multiple Trees
نویسندگان
چکیده
منابع مشابه
Obtaining Repetitive Actions for Genetic Programming with Multiple Trees
This paper proposes a method to improve genetic programming with multiple trees (GPCN). An individual in GPCN comprises multiple trees, and each tree has a number P that indicates the number of repetitive actions based on the tree. In previous work, a method for updating the number P has been proposed to obtain P suitable to the tree in evolution. However, in the method efficiency becomes worse...
متن کاملGenetic Algorithm Based Approach for Obtaining Alignment of Multiple Sequences
This paper presents genetic algorithm based solution for determing alignment of multiple molecular sequences. Two datasets from DNA families Canis_familiaris and galaxy dataset have been considered for experimental work & analysis. Genetic operators like cross over rate, mutation rate can be defined by the user. Experiments & observations were recorded w.r.t variable parameters like fixed popul...
متن کاملThe Program Structure of Genetic Programming Trees
Recent work has started to examine the structure of trees on a large scale to determine if they have an impact on the solutions found in genetic programming (GP) and also as measures of diversity and convergence. Much of the focus has been on the shape of evolved trees. Our work changes this focus onto the symbol space, an indication of what program functions and terminals exist, at what depth,...
متن کاملEvolving high-level imperative program trees with genetic programming
Genetic Programming (GP) is a technique which uses an evolutionary metaphor to automatically generate computer programs. Although GP proclaims to evolve computer programs, historically it has been used to produce code which more closely resembles mathematical formulae than the well structured programs that modern programmers aim to produce. The objective of this thesis is to explore the use of ...
متن کاملApplying genetic programming technique in classification trees
Classification problems are often encountered in many applications. In the past, classification trees were often generated by decision-tree methods and commonly used to solve classification problems. In this paper, we have proposed an algorithm based on genetic programming to search for an appropriate classification tree according to some criteria. The classification tree obtained can be transf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.08.111